Recombinant Skeleton Using Junction Points in Skeleton Based Images

نویسنده

  • Komala Lakshmi
چکیده

We perform the task of combining two skeleton images and to produce the recombinant skeleton. We propose the recombinant skeleton algorithm to produce the recombinant skeletons. The existing skeleton representation has been taken and the merge vertex detection algorithm was used before applying the recombinant skeleton algorithm. We can design and apply this recombinant skeleton in motion detection, image matching, tracking, panorama stitching, 3D modeling and object recognition. We can generate or manufacture the true real time object from the recombinant skeleton produced. The proposed method utilize local search algorithm for junction validation. Our frame work suggests the range of possibility in getting the recombinant skeleton. The boundary is essential for any transformation hence the bamboo skeleton algorithm is deployed for computing the boundary and for storing the skeleton together with the boundary. Thus our representation is skeleton with border or outline. From this new skeleton representation the proposed recombinant is achieved. KeywordsRecombinant skeleton; bamboo skeleton; valance skeleton point (VSP); core skeleton point(CSP); junction skeleton points (JSP).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skeleton Graph Matching Based on Critical Points Using Path Similarity

This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical points (junction points and end points) on skeleton graphs by comparing the geodesic paths between end points and junction points of the skeleton. Our method is motivated by the fact that junction points can carry informa...

متن کامل

Stroke Width Based Skeletonization for Text Images

Skeletonization is a morphological operation that transforms an original object into a subset, which is called a ‘skeleton’. Skeletonization has been intensively studied for decades and is a challenging issue especially for special target objects. This paper proposes a novel approach to the skeletonization of text images based on stroke width detection. First, the preliminary skeleton is detect...

متن کامل

Classification of Flowers: A Symbolic Approach

In this work, we propose a skeleton based approach to classify flower images. Flowers are segmented using whorl based region merging segmentation. Skeleton of a flower is obtained from the segmented flower using a skeleton pruning method. The distance features are extracted from the skeleton endpoints and junction points. The features are normalized using discrete cosine transform. The reduced ...

متن کامل

Delaunay Triangulation on Skeleton of Flowers for Classification

In this work, we propose a Triangle based approach to classify flower images. Initially, flowers are segmented using whorl based region merging segmentation. Skeleton of a flower is obtained from the segmented flower using a skeleton pruning method. The Delaunay triangulation is obtained from the endpoints and junction points detected on the skeleton. The length and angle features are extracted...

متن کامل

Part-type Segmentation of Articulated Voxel-Shapes using the Junction Rule

We present a part-type segmentation method for articulated voxel-shapes based on curve skeletons. Shapes are considered to consist of several simpler, intersecting shapes. Our method is based on the junction rule: the observation that two intersecting shapes generate an additional junction in their joined curve-skeleton near the place of intersection. For each curve-skeleton point, we construct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011